A Ramsey problem of Harary on graphs with prescribed size
نویسندگان
چکیده
منابع مشابه
A Ramsey problem of Harary on graphs with prescribed size
Lower bounds on the Ramsey number r(G, H), as a function of the size of the graphs G and H, are determined. In particular, if H is a graph with n lines, lower bounds for r(H) = r(H, H) and r(K,, H) are calculated in terms of n in the first case and m and n in the second case. For m = 3 an upper bound is also determined. These results partially answer a question raised by Harary about the relati...
متن کاملA note on Ramsey size-linear graphs
We show that if G is a Ramsey size-linear graph and x,y 2 V(G ) then if we add a sufficiently long path between x and y we obtain a new Ramsey size-linear graph. As a consequence we show that if G is any graph such that every cycle in G contains at least four consecutive vertices of degree 2 then G is Ramsey size-linear. ß 2002 John Wiley & Sons, Inc. J Graph Theory 39: 1–5, 2002
متن کاملPartitioning Harary graphs into connected subgraphs containing prescribed vertices
A graph G is arbitrarily partitionable (AP for short) if for every partition (n1, n2, ..., np) of |V (G)| there exists a partition (V1, V2, ..., Vp) of V (G) such that each Vi induces a connected subgraph of G with order ni. If, additionally, k of these subgraphs (k ≤ p) each contains an arbitrary vertex of G prescribed beforehand, then G is arbitrarily partitionable under k prescriptions (AP+k...
متن کاملOn Size Ramsey Numbers of Graphs with Bounded Degree
Answering a question of J. Beck B2], we prove that there exists a graph G on n vertices with maximum degree three and the size Ramsey number ^ r(G) cn(log n) where and c are positive constants. For graphs G and F, write F ! G to mean that if the edges of F are colored by red and blue, then F contains a monochromatic copy of G. Erd} os, Faudree, Rousseau and Schelp EFRS] were the rst to consider...
متن کاملOn the vertex arboricity of graphs with prescribed size
ON THE VERTEX ARBORICITY OF GRAPHS WITH PRESCRIBED SIZE Nirmala Achuthan, N.R. Achuthan and L. Caccetta School of Mathematics and Statistics Curtin University of Technology G.P.O. Box U1987 PERTH WA 6845 Let ~(n) denote the class of simple graphs of order n and ~(n,m) the subclass of graphs with size m. G denotes the complement of a graph G. For a graph G, the vertex arboricity p(G), is the min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90173-7